Off-Line Temporary Tasks Assignment
نویسندگان
چکیده
In this paper we consider the temporary tasks assignment problem. In this problem, there are m parallel machines and n independent jobs. Each job has an arrival time, a departure time and some weight. Each job should be assigned to one machine. The load on a machine at a certain time is the sum of the weights of jobs assigned to it at that time. The objective is to nd an assignment that minimizes the maximum load over machines and time. We present a polynomial time approximation scheme for the case in which the number of machines is xed. We also show that for the case in which the number of machines is given as part of the input (i.e., not xed), no algorithm can achieve a better approximation ratio than 4 3 unless P = NP.
منابع مشابه
An Analytical Approach for Single and Mixed-Model Assembly Line Rebalancing and Worker Assignment Problem
In this paper, an analytical approach is used for assembly line rebalancing and worker assignment for single and mixed-model assembly lines based on a heuristic-simulation algorithm. This approach helps to managers to select a better marketing strategy when different combinations of demands are suitable.Furthermore, they can use it as a guideline to know which worker assignment is better for ea...
متن کاملOn-line restricted assignment of temporary tasks with unknown durations
We consider load balancing of temporary tasks on m machines in the restricted assignment model. It is known that the best competitive ratio for this problem is Θ( √ m). This bound is not achieved by the greedy algorithm whose competitive ratio is known to be Ω(m 2 3 ). We give an alternative analysis to the greedy algorithm which is better than the known analysis for relatively small values of ...
متن کاملAttribute Assignment for the Integration of Off-line and Fixed Priority Scheduling
In this paper we present work to combine fixed priority scheduling with off-line schedule construction.It assumes a schedule has been constructed off-line for a set of tasks to meet their complex constraints.Our method takes the schedule and assigns the FPS attributes priority, offset, and period, to the tasks, such that their runtime FPS execution matches the off-line schedule.It does so by di...
متن کاملOptimal Priority Assignment for Aperiodic Tasks with Firm Deadlines in Fixed Priority Pre-Emptive Systems
An optimal priority assignment policy is presented for independent aperiodic tasks with arbitrary ready times and firm deadlines, scheduled on a uniprocessor along with a set of hard periodic/sporadic tasks. The latter tasks are assumed to have been assigned unique fixed priorities according to some arbitrary policy and guaranteed, via off-line feasibility analysis, to meet their deadlines. In ...
متن کاملScheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow
This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999